package com.hdu.point_offer;

public class lcr194 {


    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    class Solution {
        public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
            if (root == null) return null;
            if ((root.val - p.val) * (root.val - q.val) <= 0)
            {
                return root;
            }
            if (root.val > p.val && root.val > q.val)
            {
                return lowestCommonAncestor(root.left, p, q);
            }
            else
            {
                return lowestCommonAncestor(root.right, p, q);
            }
        }
    }
}
